Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite

The daily photograph scheduling problem of earth observation satellites like Spot 5 consists in scheduling a subset of mono or stereo photographs from a set of candidates to different cameras. The scheduling must optimize a cost function while satisfying a large number of constraints. In this paper, we first present a formulation of the problem as a generalized version of the well-known knapsac...

Upper Bounds for the SPOT 5 Daily PhotographS

Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties

  Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...